Research on limited buffer scheduling problems in flexible flow shops with setup times
نویسندگان
چکیده
منابع مشابه
Scheduling Flow - Shops with Limited Buffer Spaces
The work described in this paper attempts to validate the implicit assumption in traditional flow shop scheduling research that there is a buffer of infinite capacity between any two adjacent machines. The modified NEH (Nawaz, Encore and Ham) algorithm is used to generate an initial permutation schedule which is then improved by tabu search. For any given sequence, a limited equal buffer size i...
متن کاملGroup Scheduling Problems in Flexible Flow Shops
Flexible flow shops are becoming increasingly common in industry practice because of higher workloads imposed by jobs on one or more stages, thus requiring two or more units of the same machine type. We present a methodology for solving this important problem, namely group scheduling, within the context of cellular manufacturing systems in order to minimize the total completion time of all grou...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملSequencing Heuristics for Flexible Flow Shop Scheduling Problems with Unrelated Parallel Machines and Setup Times
This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of which may have only one machine, but at least one ...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modelling, Identification and Control
سال: 2019
ISSN: 1746-6172,1746-6180
DOI: 10.1504/ijmic.2019.102360